Interference-aware assignment of programming levels in analog memory cells

ABSTRACT

A method for data storage includes accepting data for storage in a memory including multiple analog memory cells. For each memory cell, a respective set of nominal analog values is assigned for representing data values to be stored in the memory cell, by choosing the nominal analog values for a given memory cell in a respective range that depends on interference between the given memory cell and at least one other memory cell in the memory. The data is stored in each memory cell using the respective selected set of the nominal analog values.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 13/176,761, filed Jul. 6, 2011 which claims the benefit of U.S. Provisional Patent Application 61/363,248, filed Jul. 11, 2010, U.S. Provisional Patent Application 61/372,921, filed Aug. 12, 2010, U.S. Provisional Patent Application 61/417,218, filed Nov. 25, 2010, and U.S. Provisional Patent Application 61/417,315, filed Nov. 26, 2010, whose disclosures are incorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates generally to memory devices, and particularly to methods and systems for data storage in analog memory cells.

BACKGROUND OF THE INVENTION

In arrays of analog memory cells, such as in Flash memory devices, memory cells may suffer from interference from other memory cells in the array. This interference may introduce read errors and therefore degrade the storage reliability of the memory. Various techniques for interference estimation and cancellation in analog memory cell arrays are known in the art.

For example, PCT International Publication WO 2007/132457, whose disclosure is incorporated herein by reference, describes a method for operating a memory device. The method includes encoding data using an Error Correction Code (ECC) and storing the encoded data as first analog values in respective analog memory cells of the memory device. After storing the encoded data, second analog values are read from the respective memory cells of the memory device in which the encoded data were stored. At least some of the second analog values differ from the respective first analog values. A distortion that is present in the second analog values is estimated. Error correction metrics are computed with respect to the second analog values responsively to the estimated distortion. The second analog values are processed using the error correction metrics in an ECC decoding process, so as to reconstruct the data. Other example interference cancellation methods are described in PCT International Publication WO 2007/132453, whose disclosure is incorporated herein by reference.

In some known techniques, compensation for interference is carried out during programming of the memory cells. For example, U.S. Pat. No. 7,885,119, whose disclosure is incorporated herein by reference, describes techniques that compensate for electric field coupling in a programming process that takes into account the programmed state of an adjacent memory cell. To determine whether compensation is needed, the process may include sensing information about the programmed state of the adjacent memory cell, for example on an adjacent bit line or other location.

As another example, PCT International Publication WO 2009/038961, whose disclosure is incorporated herein by reference, describes a programming process for a given memory cell, which verifies the amount of programming after each programming pulse. The standard verify level for the programming cell is dependent on the target state. The verify level is further offset lower dependent on the amount of perturbation from neighboring cells, determinable by their target states.

SUMMARY OF THE INVENTION

A method for data storage includes accepting data for storage in a memory including multiple analog memory cells. For each memory cell, a respective set of nominal analog values is assigned for representing data values to be stored in the memory cell, by choosing the nominal analog values for a given memory cell in a respective range that depends on interference between the given memory cell and at least one other memory cell in the memory. The data is stored in each memory cell using the respective selected set of the nominal analog values.

In some embodiments, assigning the nominal analog values includes choosing the nominal analog values for the given memory cell in a first range when the given memory cell is subjected to the interference from the at least one other memory cell, and choosing the nominal analog values for the given memory cell in a second range, lower than the first range, when the given memory cell is not subjected to the interference from the at least one other memory cell.

In some embodiments, assigning the nominal analog values includes choosing the nominal analog values for the given memory cell in a first range when the given memory cell is expected to cause the interference to the at least one other memory cell, and choosing the nominal analog values for the given memory cell in a second range, higher than the first range, when the given memory cell is not expected to cause the interference to the at least one other memory cell.

In an embodiment, assigning the nominal analog values includes selecting, for each memory cell, at least one parameter selected from a group of parameters consisting of a minimum programming voltage, a maximum programming voltage, and a size of the set of the nominal analog values.

In a disclosed embodiment, assigning the nominal analog values includes, for a group of N memory cells, dividing an N-dimensional space spanned by respective analog values of the N memory cell into a first region that is not available for positioning combinations of programming levels due to the interference, and a second region that is available for positioning the combinations of programming levels, and assigning the sets of the nominal analog values to the N memory cells only within the second region. In an embodiment, the second region is non-cubical. In an embodiment, the second region is a polytope.

In another embodiment, assigning the nominal analog values includes choosing the nominal analog values in the range in which a maximum difference between the nominal analog values assigned to the given memory cell and the nominal analog values assigned to the at least one other memory cell does not exceed a predefined threshold. In yet another embodiment, assigning the nominal analog values includes assigning to the given memory cell a first number of the analog values when the interference is low, and a second number of the analog values, lower than the first number, when the interference is high.

In still another embodiment, assigning the nominal analog values includes providing a baseline set of the analog values, and assigning to each memory cell a respective subset of the baseline set, which lies in the respective range, depending on the interference. In an embodiment, storing the data includes encoding the accepted data with a code that causes the encoded data to be mapped to the nominal analog values chosen within the respective range in each memory cell. The code may include a Trellis Shaping code.

In a disclosed embodiment, assigning the nominal analog values for a group of the memory cells includes initially choosing the nominal analog values for all the memory cells in the group, and subsequently mapping a respective data value to one of the chosen nominal analog values in each of the memory cells. In an alternative embodiment, assigning the nominal analog values for a group of the memory cells includes choosing the nominal analog values for a first memory cell in the group and mapping a respective data value to one of the nominal analog values chosen for the first memory cell, and choosing the nominal analog values for a second memory cell in the group based on the data value mapped to the first memory cell. In an example embodiment, assigning the nominal analog values includes assigning at least one negative nominal analog value for representing a non-erased programming level.

In some embodiments, the method includes storing information indicative of the assigned sets of the nominal analog values. The method may include retrieving the data from the memory cells by retrieving the stored information, recreating the assigned sets from the retrieved information, and reading the data from the memory cells in accordance with the recreated sets of the nominal analog values.

In an embodiment, storing the information includes encoding the information with an Error Correction Code (ECC) to produce data bits and redundancy bits and storing only the redundancy bits, and recreating the assigned sets includes reading some of the memory cells so as to estimate assignment of the sets, applying error correction to the estimated assignment using the stored redundancy bits, and recreating the sets from the estimated assignment after the error correction.

In another embodiment, the memory cells include at least first and second memory cells, and assigning the nominal analog values includes assigning respective, different first and second sets of the analog values to the first and second memory cells. In yet another embodiment, assigning the nominal analog values includes assigning to first and second memory cells respective first and second sets of the nominal analog values having at least one nominal analog value in common. In still another embodiment, assigning the nominal analog values includes assigning to first and second memory cells respective first and second sets of the nominal analog values, such that the first set is a subset of the second set.

In some embodiments, two or more memory cells are assigned respective sets of the nominal analog values that are drawn from a superset of K possible nominal analog values, and storing the data includes shaping a sequence of data bits into respective shaped bits, and storing the shaped bits in the respective memory cells using the assigned sets.

There is additionally provided, in accordance with an embodiment of the present invention, a data storage apparatus including an interface and programming circuitry. The interface is configured for communicating with a memory including multiple analog memory cells. The programming circuitry is configured to accept data for storage in the memory, to assign, for each memory cell, a respective set of nominal analog values for representing data values to be stored in the memory cell, by choosing the nominal analog values for a given memory cell in a respective range that depends on interference between the given memory cell and at least one other memory cell in the memory, and to store the data in each memory cell using the respective selected set of the nominal analog values.

There is also provided, in accordance with an embodiment of the present invention, a data storage apparatus including a memory and programming circuitry. The memory includes multiple analog memory cells. The programming circuitry is configured to accept data for storage in the memory, to assign, for each memory cell, a respective set of nominal analog values for representing data values to be stored in the memory cell, by choosing the nominal analog values for a given memory cell in a respective range that depends on interference between the given memory cell and at least one other memory cell in the memory, and to store the data in each memory cell using the respective selected set of the nominal analog values.

The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram that schematically illustrates a memory system, in accordance with an embodiment of the present invention;

FIGS. 2A-2D are graphs showing threshold voltage distributions of an erased level in various interference scenarios, in accordance with embodiments of the present invention;

FIG. 3 is a diagram showing attainable and non-attainable threshold voltage regions, in accordance with an embodiment of the present invention;

FIGS. 4A-4E are diagrams showing programming level constellations that are positioned in an attainable region, in accordance with embodiments of the present invention;

FIGS. 5A-5C are graphs showing selected programming level constellations for various interference scenarios, in accordance with an embodiment of the present invention;

FIG. 6 is a graph showing selected programming level constellations for various interference scenarios, in accordance with an alternative embodiment of the present invention;

FIG. 7 is a flow chart that schematically illustrates a method for data storage, in accordance with an embodiment of the present invention; and

FIGS. 8A-8C are graphs showing programming level constellations, in accordance with embodiments of the present invention.

DETAILED DESCRIPTION OF EMBODIMENTS Overview

In practical memory devices, memory cells may cause interference to one another, for example because of electric field cross-coupling between the memory cells. This interference may cause read errors and degrade the storage reliability of the memory. Embodiments of the present invention that are described herein provide improved methods and systems for reducing interference in arrays of analog memory cells.

In some embodiments, a memory system comprises programming circuitry that stores data in an array of analog memory cells. Data is stored in each memory cell by writing into the memory cell a nominal analog value, which is selected from a set of nominal storage values that represent respective data values. The nominal analog values that represent the different data values are also referred to as programming levels, and the two terms are used interchangeably hereinbelow.

In the disclosed embodiments, the programming circuitry assigns a respective set of programming levels individually for each memory cell. The set of programming levels for a given memory cell is assigned depending on the (current or expected) interference between this memory cell and at least one other memory cell in the array.

For example, a memory cell that suffers from severe interference from neighboring memory cells may be assigned programming levels having high analog values. As will be explained below, the analog values of memory cells that are in an erased level suffer from particularly severe distortion due to interference. This distortion often makes it difficult to distinguish between the erased level and other programming levels. Assigning programming levels having high analog values to severely-interfered memory cells solves this problem. By contrast, a memory cell that does not experience severe interference may be assigned programming levels having low analog values.

As another example, a memory cell that is expected to cause severe interference to a neighboring memory cell (e.g., because the memory cell is to be programmed to a high analog value) may be assigned programming levels having low analog values in order to reduce the interference.

In some disclosed techniques, the assignment process considers a group of N memory cells that potentially cause interference to one another. The combinations of analog values of these N memory cells can be viewed as an N-dimensional space. This space can be divided into a region that is not attainable for positioning programming levels due to the interference, and a region that is attainable. The programming circuitry distinguishes between these two regions, and assigns the programming levels for the N memory cells only within the attainable region.

In other disclosed embodiments, the programming circuitry holds a predefined full set of programming levels, and assigns each memory cell a respective subset of these programming levels depending on interference conditions.

Several example assignment schemes are described herein. In some of the assignment schemes, the storage density (e.g., the number of bits per cell) is varied depending on the level of interference. In some embodiments, the programming circuitry stores information indicative of the programming levels that were assigned to the various memory cells, in order to enable data readout from each memory cell using the appropriate programmed levels.

The disclosed techniques thus assign each memory cell a respective set of programming levels that is tailored to the specific interference conditions of that memory cell. Therefore, these techniques are highly effective in reducing interference while optimizing storage reliability and capacity.

System Description

FIG. 1 is a block diagram that schematically illustrates a memory system 20, in accordance with an embodiment of the present invention. System 20 can be used in various host systems and devices, such as in computing devices, cellular phones or other communication terminals, removable memory modules (“USB drive” devices), Solid State Disks (SSD), digital cameras, music and other media players and/or any other system or device in which data is stored and retrieved.

System 20 comprises a memory device 24, which stores data in a memory cell array 28. The memory array comprises multiple analog memory cells 32. In the context of the present patent application and in the claims, the term “analog memory cell” is used to describe any memory cell that holds a continuous, analog value of a physical parameter, such as an electrical voltage or charge. Array 28 may comprise analog memory cells of any kind, such as, for example, NAND, NOR and Charge Trap Flash (CTF) Flash cells, phase change RAM (PRAM, also referred to as Phase Change Memory—PCM), Nitride Read Only Memory (NROM), Ferroelectric RAM (FRAM), magnetic RAM (MRAM) and/or Dynamic RAM (DRAM) cells.

The charge levels stored in the cells and/or the analog voltages or currents written into and read out of the cells are referred to herein collectively as analog values, analog storage values or storage values. Although the embodiments described herein mainly address threshold voltages, the methods and systems described herein may be used with any other suitable kind of analog values.

System 20 stores data in the analog memory cells by programming the cells to assume respective programming states, which are also referred to as programming levels. The programming states are selected from a finite set of possible states, and each programming state corresponds to a certain nominal storage value. For example, a 3 bit/cell MLC can be programmed to assume one of eight possible programming states by writing one of eight possible nominal storage values into the cell.

Memory device 24 comprises a reading/writing (R/W) unit 36, which converts data for storage in the memory device to analog storage values and writes them into memory cells 32. In alternative embodiments, the R/W unit does not perform the conversion, but is provided with voltage samples, i.e., with the storage values for storage in the cells. When reading data out of array 28, R/W unit 36 converts the storage values of memory cells 32 into digital samples having a resolution of one or more bits.

Data is typically written to and read from the memory cells in groups that are referred to as pages. In some embodiments, the R/W unit can erase a group of cells 32 by applying one or more negative erasure pulses to the cells. In the embodiment of FIG. 1, R/W unit 36 comprises a memory interface 37 for communicating with memory cells 28, and R/W circuitry 38 that carries out the programming and readout functions of the R/W unit.

The storage and retrieval of data in and out of memory device 24 is performed by a Memory Signal Processor (MSP) 40. MSP 40 comprises an interface 44 for communicating with memory device 24, and a signal processing unit 48 that processes the data that is written into and read from device 24. In some embodiments, unit 48 produces the storage values for storing in the memory cells and provides these values to R/W unit 36. Alternatively, unit 48 provides the data for storage, and the conversion to storage values is carried out by the R/W unit internally to the memory device. Alternatively to using an MSP, the methods described herein can be carried out by any suitable type of memory controller.

MSP 40 communicates with a host 52, for accepting data for storage in the memory device and for outputting data retrieved from the memory device. MSP 40, and in particular unit 48, may be implemented in hardware. Alternatively, MSP 40 may comprise a microprocessor that runs suitable software, or a combination of hardware and software elements.

The configuration of FIG. 1 is an exemplary system configuration, which is shown purely for the sake of conceptual clarity. Any other suitable memory system configuration can also be used. Elements that are not necessary for understanding the principles of the present invention, such as various interfaces, addressing circuits, timing and sequencing circuits and debugging circuits, have been omitted from the figure for clarity.

In the exemplary system configuration shown in FIG. 1, memory device 24 and MSP 40 are implemented as two separate Integrated Circuits (ICs). In alternative embodiments, however, the memory device and the MSP may be integrated on separate semiconductor dies in a single Multi-Chip Package (MCP) or System on Chip (SoC), and may be interconnected by an internal bus. Further alternatively, some or all of the MSP circuitry may reside on the same die on which the memory array is disposed. Further alternatively, some or all of the functionality of MSP 40 can be implemented in software and carried out by a processor or other element of the host system. In some embodiments, host 44 and MSP 40 may be fabricated on the same die, or on separate dies in the same device package.

In some embodiments, MSP 40 (or other memory controller that carries out the methods described herein) comprises a general-purpose processor, which is programmed in software to carry out the functions described herein. The software may be downloaded to the processor in electronic form, over a network, for example, or it may, alternatively or additionally, be provided and/or stored on non-transitory tangible media, such as magnetic, optical, or electronic memory.

In an example configuration of array 28, memory cells 32 are arranged in multiple rows and columns, and each memory cell comprises a floating-gate transistor. The gates of the transistors in each row are connected by word lines, and the sources of the transistors in each column are connected by bit lines. The memory array is typically divided into multiple pages, i.e., groups of memory cells that are programmed and read simultaneously. Pages are sometimes sub-divided into sectors. In some embodiments, each page comprises an entire row of the array. In alternative embodiments, each row (word line) can be divided into two or more pages. For example, in some devices each row is divided into two pages, one comprising the odd-order cells and the other comprising the even-order cells. In a typical implementation, a two-bit-per-cell memory device may have four pages per row, a three-bit-per-cell memory device may have six pages per row, and a four-bit-per-cell memory device may have eight pages per row.

Erasing of cells is usually carried out in blocks that contain multiple pages. Such blocks are referred to herein as erasure blocks or memory blocks. Typical memory devices may comprise several thousand erasure blocks. In a typical two-bit-per-cell MLC device, each erasure block is on the order of 32 word lines, each comprising several tens of thousands of cells. Each word line of such a device is often partitioned into four pages (odd/even order cells, least/most significant bit of the cells). Three-bit-per cell devices having 32 word lines per erasure block would have 192 pages per erasure block, and four-bit-per-cell devices would have 256 pages per block. Alternatively, other block sizes and configurations can also be used. Some memory devices comprise two or more separate memory cell arrays, often referred to as planes. Since each plane has a certain “busy” period between successive write operations, data can be written alternately to the different planes in order to increase programming speed.

In some embodiments, R/W unit 36 programs memory cells 32 using an iterative Program and Verify (P&V) process. In a typical P&V process, an entire group of memory cells (e.g., a word line) is programmed by applying a sequence of programming pulses to the memory cells in the group. The storage values programmed in the cells are read after each pulse and compared (“verified”) with one or more verification thresholds. The programming iterations continue selectively only for memory cells that have not yet reached the desired levels.

Effect of Cross-Coupling Interference on Erased Level Distribution

In a typical implementation, memory cells are erased by setting them to a certain range of threshold voltages referred to as an “erased level.” Typically although not necessarily, the erased level occupies a range of negative threshold voltages, while the other programming levels occupy respective ranges of positive threshold voltages. (The erased level is regarded herein as one of the programming levels, since when the memory cells are programmed, one of the possible data values typically corresponds to this level.)

When erased memory cells are subject to cross-coupling interference from neighboring memory cells, the interference may cause the threshold voltages of the erased cells to increase, possibly to large positive values. This effect decreases the threshold voltage range that is available for the other programming levels (sometimes referred to as “voltage window”), and may therefore degrade the reliability and storage capacity of the memory.

Consider, for example, a Flash memory in which the erase level is defined as the range −5V≦Vt≦−3.5V, and the threshold voltages of programmed cells can reach up to 5V. Assume that each erased cell is affected by four neighboring cells with a cross-coupling ratio of 20%. The shift caused to the threshold voltages of the erased cells can reach up to 0.2×4×(5−(−5))=8V. This shift causes severe widening of the threshold voltage distribution of the erased cells, which can reach threshold voltages of up to −3.5+8=4.5V. The following figures demonstrate the severity of this effect.

FIGS. 2A-2D are graphs showing threshold voltage distributions of an erased level in various interference scenarios, in accordance with embodiments of the present invention. FIG. 2A shows the distribution of threshold voltages in the absence of cross-coupling interference. In this case, the erased level distribution lies between −5V and −3.5V. FIG. 2B shows the threshold voltage distribution of the erased level under worst-case interference, i.e., when all four neighbor cells are programmed from Vt=−5V to Vt=5V. In this case, the erased level distribution lies between 3V and 4.5V.

FIG. 2C shows an intermediate case, in which the four neighbor cells are programmed from Vt=−4V to Vt=4V. In this case, the erased level distribution lies between 1.4V and 2.9V. FIG. 2D shows the threshold voltage distribution of the erased level, when averaged over the various possible neighbor cell values. As can be seen in the figure, the center of the threshold voltage distribution is shifted from approximately −4V to approximately 0V. The erased level distribution is also considerably widened, reaching up to 4.5V.

As can be appreciated from these figures, the shift in threshold voltages of erased cells due to cross-coupling interference may span a large part of the available voltage window. This effect may cause considerable degradation in storage capacity, endurance and reliability. In the extreme example of FIGS. 2A-2D, only 0.5V out of the 5V voltage window remains for programming the memory cells.

In milder cases (e.g., when the coupling ratios are lower or when the threshold voltages of the erased cells are far below zero) the threshold voltages of erased cells may remain below zero following the interference-related shift. Nevertheless, the shift and widening of the erased level may degrade storage performance. For example, in some embodiments one or more of the programming levels other than the erased level occupies a range of negative threshold voltages. Techniques of this sort are described, for example, in U.S. Pat. No. 7,751,240, whose disclosure is incorporated herein by reference. When using such schemes, any shift or widening of the erased level may decrease the voltage range that is available for programming

In order to reduce interference, in some embodiments the memory cells are programmed in a gradual, interleaved manner. In these embodiments, neighboring cells are partially programmed before the potentially-interfered cells are programmed to their final values. Programming orders for reducing interference are addressed, for example, by Takeuchi et al., in “A Multipage Cell Architecture for High-Speed Programming Multilevel NAND Flash Memories,” IEEE Journal of Solid-State Circuits, volume 33, issue 8, August, 1998, pages 1228-1238, which is incorporated herein by reference, and in PCT International Publication WO 2009/037691, whose disclosure is incorporated herein by reference. This sort of programming is effective in reducing interference to the programming levels other than the erased level. Interference to the erased level and the resulting voltage window degradation, however, are generally unaffected by this technique.

In some embodiments of the present invention, system 20 assigns a set of programming levels for each memory cell 32 depending on the expected interference between the memory cell and at least one neighbor cell. In some embodiments, the programming levels are defined jointly for groups of mutually-interfering memory cells. Example techniques of this sort are shown in FIGS. 3 and 4A-4E below. In other embodiments, the set of programming levels is selected individually for each memory cell depending on the expected interference to and/or from neighboring cells. Example techniques of this sort are shown in FIGS. 5A-5C and 6 further below.

Interference Mitigation by Assignment of Programming Levels in Attainable Threshold Voltage Regions

In some embodiments, system 20 assigns the programming levels jointly for a group of N memory cells, depending on the mutual interference among the memory cells in the group. In some embodiments, system 20 divides the N-dimensional space of threshold voltages of the N memory cells into an attainable region and a non-attainable region, and assigns the programming levels in the attainable region. The term “attainable region” means a region of threshold voltage combinations that are available for positioning programming levels, even in the presence of inter-cell interference. The term “non-attainable region” means a region of threshold voltage combinations that is not available for positioning programming levels due to the interference.

Consider, for example, two neighboring memory cells 32 that potentially cause cross-coupling interference to one another. In the present example, an erased cell has a threshold voltage of −3V before its neighbor cell is programmed, and the maximum possible programmable threshold voltage is 4V. The coupling ratio between the two memory cells is assumed to be 20%. We shall assume that the two cells interfere with each other, but they are not interfered by any other memory cell. Assume also that the memory cells are programmed in an interleaved manner, as explained above, such that interference to programmed levels is compensated for.

In this example, when the threshold voltage of one cell is X volts, the interference caused to the other cell is 0.2·(X−(−3))=0.6+X/5 volts. When the interfered cell is in the erased level, its threshold voltage is increased from Vt=−3V to Vt=−2.4+X/5V. (Put in another way, the interference can be written as 0.2·(X′+3) wherein X′ denotes the interference-free read threshold of the interfering cell. When all the neighbors of the interfering cell are erased, X′=X, and the latter equation becomes equivalent to the former.)

FIG. 3 is a diagram showing attainable and non-attainable threshold voltage regions, in accordance with an embodiment of the present invention. The figure shows a two-dimensional space of threshold voltages of the two memory cells. The horizontal axis corresponds to the threshold voltage of the first memory cell, and the vertical axis corresponds to the threshold voltage of the second memory cell.

An attainable region 60 defines the threshold voltage combinations (pairs of {Vt of the first memory cell, Vt of the second memory cell}) that are attainable in spite of the interference between the memory cells. A non-attainable region 64 defines the threshold voltage combinations that are not attainable because of the interference between the memory cells. As can be seen in the figure, the attainable region contains threshold voltage pairs in which one memory cell has a low threshold voltage and the other memory cell has a high threshold voltage. In such a situation, the latter memory cell is likely to cause interference to the former memory cell that prevents it from being at a low threshold voltage. Such pairs of threshold voltages are therefore not available for positioning of programming levels, and should be avoided.

In some embodiments, system 20 assigns the programming levels for the two memory cells within the attainable region, and does not assign programming levels in the non-attainable region. As a result, the cross-coupling interference to the erased cells and to cells that are at low threshold voltage is avoided.

In some embodiments, the attainable region can be defined in terms of the difference between the analog values assigned to the first memory cell and the analog values assigned to the second memory cell, possibly after scaling each analog value by a certain constant. In these embodiments, system 20 assigns the programming levels such that the maximum difference between the analog values assigned to the first memory cell and the analog values assigned to the second memory cell does not exceed a predefined threshold.

The shapes of the attainable and non-attainable regions typically depend on the minimum and maximum possible threshold voltages, and on the coupling ratio between the memory cells. In the present example, the size of the attainable region is approximately 80% of the overall [−3,4)×[−3,4) space. In real-life memory devices having a coupling ratio of 20%, the actual size of the attainable region may be smaller, because interference is caused by more than one neighboring cell (e.g., two dominant interfering cells that are positioned vertically relative to the interfered cell in the cell array, two horizontally-positioned interfering cells and four weaker diagonally-positioned interfering cells).

FIGS. 4A-4E are diagrams showing programming level constellations that are positioned in the attainable region, in accordance with embodiments of the present invention. Similarly to FIG. 3 above, diagonal lines mark the boundaries between the attainable and non-attainable regions. In all of these examples, system 20 assigns the programming levels for the two memory cells within attainable region 60.

The examples of FIGS. 4A-4E show programming level constellations for a pair of eight-level, 3 bits/cell memory cells. Threshold voltages 68 and 72, marked as points in the two-dimensional Vt space, represent the centers of the threshold voltage distributions. In other words, points 68 and 72 denote nominal analog values that represent the various data value combinations to be stored in the memory cells. Points 68 denote threshold voltage pairs for which at least one of the memory cells is in the erased level. Points 72 denote threshold voltage pairs for which both memory cells are in non-erased programming levels. The widths of the threshold voltage distributions are not shown in the figures for the sake of clarity.

In the constellation of FIG. 4A, the erased levels of both memory cells are represented by negative threshold voltages, while the non-erased programming levels are represented by positive (or at least non-negative) threshold voltages. The threshold voltages representing the non-erased levels lie on a regular Cartesian grid. Each memory cell may be in the erased level, or in one of seven non-erased programming levels whose nominal analog values are defined as PVi=(i−1)×2/3 Volts, i=1 . . . 7. The nominal analog values of the two memory cells are distributed uniformly in the square [0,4)×[0,4). The constellation of FIG. 4A can be generalized in a straightforward manner to N>2 memory cells, by setting the nominal analog values of the non-erased programming levels on a regular grid in the N-dimensional hyper-cube [0,Vmax)^(N).

When using the programming level constellation of FIG. 4A, data can be read from the memory cells using non-negative read thresholds that may be positioned separately for each memory cell. This constellation is suitable, for example, in memory devices that are not able to apply negative read thresholds and negative programming thresholds.

The constellation of FIG. 4B, on the other hand, can be used in memory devices that are capable of applying negative read thresholds and programming thresholds, such as the devices described in U.S. Pat. No. 7,751,240, cited above. In this example, the nominal analog values of non-erased programming levels are allowed to occupy negative threshold voltages. As a result, the programming levels are distributed with greater distances from one another, thereby improving storage reliability. In this particular example, each memory cell may be in the erased level, or in one of seven non-erased programming levels whose nominal analog values are defined as PVi=−3+i Volts, i=1 . . . 7. In this example, however, some pairs of programming levels fall in region 64 and are therefore not attainable, and some pairs of programming levels are very close to region 64 and therefore have small distances from other pairs of programming levels. These properties may degrade storage performance.

The constellation of FIG. 4C provides an alternative trade-off. In this example, each memory cell may be in the erased level, or in one of seven non-erased programming levels whose nominal analog values are distributed uniformly in the square [−0.8,Vmax]×[−0.8,Vmax]. In the example of FIG. 4C one non-erased programming level of each memory cell corresponds to a negative threshold voltage, and all the programming levels lie in the attainable region. On the other hand, some of the attainable region (e.g., X<−1V or Y<−1V) is not occupied.

In some embodiments, the attainable region in which system 20 sets the nominal analog values of the programming levels is defined as the polytope (N-dimensional polygon):

$\begin{matrix} {R = \left\{ \left( {x_{1},\ldots\mspace{14mu},x_{N}} \right) \middle| {x_{i} > \begin{matrix} {{V_{E} < x_{i} < V_{\max}},} \\ {V_{E} + {\sum\limits_{j}{a_{ij}\left\lbrack {(x\rbrack_{j} - V_{E}} \right)}}} \\ {{\forall i} = {1\mspace{14mu}\ldots\mspace{14mu} N}} \end{matrix}} \right\}} & \lbrack 1\rbrack \end{matrix}$

In Equation 1, V_(E) denotes the lowest threshold voltage used for erased levels (the upper edge of the erased level Vt distribution, after retention and in the absence of interference), V_(max) denotes the highest threshold voltages used for representing the programming levels, N denotes the number of memory cells in the group, and a_(ij) denote the interference coupling coefficients between memory cells i and j. This sort of N-dimensional polygon is formed by removing the non-attainable region from the N-dimensional hyper-cube [V_(E),V_(max)]^(N). Attainable region 60 of FIG. 3 above is a two-dimensional example of such a polygon.

System 20 can assign the programming levels in this attainable region in various ways. For example, FIG. 4D shows a constellation in which the number of programming levels (and therefore the storage density or the number of bits per cell) varies depending on the level of interference. As can be seen by comparing FIG. 4D with FIG. 4C, the constellation of FIG. 4D has five additional points 72 (corresponding to −1.6V) in the previously-unused areas of the attainable region. The non-erased programming levels remain on the same Cartesian grid as in FIG. 4C.

In this constellation, when interference between the memory cells is low, one or both memory cells use nine programming levels instead of eight. Thus, on average, the storage capacity is improved. Since the additional programming levels are used only when interference is low, without decreasing the distances between adjacent programming levels, storage reliability is not affected.

In some embodiments, departing from a Cartesian grid enables increasing the number of programming levels without reducing the distances between adjacent levels. Non-Cartesian constellations enable better use of the attainable region. Alternatively, using a non-Cartesian grid enables increasing the distances between adjacent programming levels for a given number of programming levels.

FIG. 4E shows an example of such a non-Cartesian constellation. In the present example, the distances between adjacent programming levels are improved relative to FIG. 4C because the constellation points fill the attainable range more evenly. Note that in this example the distances between constellation points are not uniform, and the distances between constellation points in which one of the cells is at its maximum programming voltage are equal to the distances between constellation points in the constellation used in FIG. 4C. FIG. 4E demonstrates that non-Cartesian constellations are superior to Cartesian constellation, but it does not necessarily show the optimal constellation in the sense of minimum distance between pairs. A more elaborated constellation design can improve the minimum distance between constellation points by taking advantage of the vacant segments of the attainable region that are not utilized by the constellation of FIG. 4C.

The programming level constellations of FIGS. 4A-4E are example constellations that are chosen purely for the sake of conceptual clarity. In alternative embodiments, any other suitable programming level constellation can be used. For example, the constellation can be defined for any suitable number of memory cells, for any suitable storage density (e.g., number of bits/cell), and/or in attainable regions having any other suitable shapes. Note that the attainable region in the above example is non-cubical.

From an Information-Theory standpoint, N threshold voltage values in N memory cells forms an N-dimensional constellation. A special case of such a constellation is an N-dimensional lattice code. The amount of information that can be reliably stored in the constellation (or lattice) depends on two factors:

-   -   The fine structure of the constellation, e.g., the distances         between its constellation points, and especially the minimum         distance. Error correction codes, such as         Bose-Chaudhuri-Hocquenghem (BCH) or Low-Density Parity Check         (LDPC) codes, are designed to improve these distances. This         improvement is known as coding gain.     -   The volume that is occupied by the constellation in the         N-dimensional space (R^(N) wherein R denotes the real numbers         axis). Shaping schemes such as the Laroia shaping (also referred         to as “flexible shaping”) or Trellis shaping schemes are         designed to increase the volume of the constellation per given         power constraints. Such techniques are described, for example,         by Formey Jr., in “Trellis Shaping,” IEEE Transactions on         Information Theory, volume 38, no. 2, March, 1992, pages         281-300, which is incorporated herein by reference. The benefit         of increasing the constellation volume is known as shaping gain.

Assuming Additive White Gaussian Noise (AWGN), two constellations having an equal density of constellation points in the N-dimensional space (e.g., based on the same lattice), and which use two different volumes V1 and V2 in the N-dimensional real-valued space, will theoretically have a difference of log₂(V1/V2)/N in the number of bits that they can transmit per cell. Moreover, in the AWGN case, an optimal capacity-achieving constellation that employs a shaping region of volume V1 will outperform the information density of an optimal capacity-achieving constellation that employs a shaping region of smaller volume V2 by a factor that is approximately log₂(V1/V2)/N bits/cell, wherein the approximation becomes more accurate as N increases.

Practically, this difference may vary due to the details of the structure of the constellation near the boundaries of the shaping region. For example, in the examples of FIGS. 4A-4E, N=2 and the volumes comprise two-dimensional regions. The volume of the polygonal attainable region (which is the shaping zone) in this example is 0.8·7·7=39.2. The optimal square region that does not overlap the non-attainable region is [−1.6,4]×[−1.6.4] and its area is 5.6·5.6=31.36. The ratio between the two volumes (areas) is 1.25. Thus, using the non-cubical shaping region (as in FIG. 4D) can improve the capacity by a factor of log₂(0.8)/2=0.16 bits/cell. The actual improvement in the 69-point constellation of FIG. 4D, over the 64-point constellation of FIG. 4C (which have the same minimum distance and internal structure) is log₂(69/64)/2=0.054 bits/cell.

Thus, the example schemes of FIGS. 4D and 4E improve the information density or noise robustness by employing non-rectangular (or more generally—non-cubical) shaping regions that are matched to the attainable region dictated by the physics of the memory array.

In some embodiments, system 20 assigns the set of programming levels for a particular memory cell by assigning the minimum and/or maximum of the nominal analog values to be written into the cell, and/or the number of programming levels to be used in programming the cell. In some embodiments, two sets of nominal analog values that are respectively assigned to two memory cells have at least one nominal analog voltage in common. In some embodiments, a set of nominal analog values assigned to a certain memory cell is a subset of the set of nominal analog values assigned to another cell.

In some embodiments, the sets of nominal analog values assigned to the various memory cells are all subsets of a “superset” of K nominal analog values. The system comprises a sequencing circuit, which accepts bits for storage and maps the bits stored in each cell to a respective nominal analog value selected from the K possible values. A shaping circuit generates bits that cause the sequencing circuit to use the appropriate subset of the K nominal analog values in each cell.

Interference Mitigation by Interference-Dependent Cell-by-Cell Selection of Programming Levels

In some embodiments, system 20 chooses a different set of these programming levels (having respective nominal analog values) for storing data in each memory cell, on a cell-by-cell basis. The set of programming levels for a given memory cell 32 is chosen depending on the interference between this memory cell and at least one other memory cell in array 28.

FIGS. 5A-5C are graphs showing selected programming level constellations for various interference scenarios, in accordance with an embodiment of the present invention. The constellations of FIGS. 5A-5C correspond to the interference scenarios of FIGS. 2A-2C above, respectively.

FIG. 5A shows a full set of eight programming levels (one erased level and seven non-erased programming levels) defined for the memory cells. The full set is chosen for a given memory cell when interference is low, for example when all the neighboring memory cells are erased.

FIG. 5B is chosen for a given memory cell when the interference is strong, as in the scenario of FIG. 2B above. In this scenario, the erased level is shifted to lie between 3V and 4.5V, and therefore only a single non-erased programming level is used, to give a total of two programming levels.

FIG. 5C is chosen for a given memory cell in intermediate interference scenarios such as the scenario of FIG. 2C above. In this scenario, the erased level is shifted to lie between 1.4V and 2.9V, and therefore two non-erased programming levels are assigned, to give a total of three programming levels.

In some embodiments, although not necessarily, system 20 uses a predefined baseline set of programming levels, and chooses the appropriate subset from this baseline set for each memory cell depending on the interference to/from that memory cell. For example, the system may use the eight-level set shown in FIG. 5A for low interference, and choose suitable subsets from this set for stronger interference scenarios. In such a case, the memory device programs or samples only eight analog levels. This feature is especially important when jointly programming or reading multiple memory cells.

As explained above, the selection of programming levels for a given memory cell typically depends on both the interference caused by the memory cell and the interference suffered by the memory cell. For example, if the memory cell suffers from strong interference, the system would typically select programming levels that correspond to high threshold voltages. If the memory cell is expected to cause strong interference to a neighboring cell (which is erased or programmed to a programming level having small threshold voltage), the system would typically select programming levels corresponding to small threshold voltages in order to reduce this interference.

FIG. 6 is a graph showing selected programming level constellations for various interference scenarios, in accordance with an alternative embodiment of the present invention. In this example, the memory device uses a full baseline set of four programming levels denoted PV0 . . . PV3. PV0 also serves as an erased level. For a given memory cell, the system chooses a suitable subset of these programming levels depending on interference conditions.

If no severe interference is expected to/from the given memory cell, the system stores data in that cell using all four programming levels. This case is shown by the top graph of FIG. 6. If the memory cell suffers strong interference from one or more neighbor cells, the system stores data in the memory cell using PV0, PV2 and PV3. This case is shown by the middle graph. If the memory cell is expected to cause strong interference to one or more neighbor cells, the system stores data in the memory cell using PV0, PV1 and PV2. This case is shown by the bottom graph of FIG. 6.

In a typical programming flow, system 20 programs memory cells 32 in an ascending order of word lines. When programming a given word line, the system first selects a set of programming levels for use in each memory cell. This selection is based on the interference caused by the memory cell to previously-programmed memory cells (in the same word line or in previously-programmed word lines) and on the interference caused to the memory cell from other memory cells. For example, in some embodiments system 20 programs the even-order cells in a given word line first, and then the odd-order cells. In such embodiments, the programming levels can be selected for the entire word line, including both even- and odd-order cells, before programming of the word line.

Alternatively, the system may select the programming levels for the even-order cells based only on interference between them and previously-programmed word lines, and then select the programming levels for the odd-order cells based on interference between them and the even-order cells of the same word line as well as the previously-programmed word lines.

In one embodiment, the system programs a given word line by first selecting the programming levels for the memory cells, and then mapping data bits to programming levels and programming the memory cells. In an alternative embodiment, the system selects the programming levels for a given memory cell, then maps data and programs this memory cell, and only then moves to select the programming levels for the next memory cell in the word line.

In the former technique, the exact number of data bits stored in the word line depends on the selected sets of programming levels, but the deviation from the average number of bits per word line is expected to be small. The latter technique is typically more accurate in selecting the programming levels per memory cell, because it has more accurate information as to the interference to and from neighboring cells. On the other hand this technique may be more complex to implement. Further alternatively, the system may perform the selection of programming levels, the mapping of data to programming levels and the actual programming of the memory cells in any other suitable order.

In an example embodiment, the system uses the constellations of FIG. 6 while programming memory cells 32 in array 28 in an ascending order of word lines (rows). Let i denote the word line (row) index and j denote the bit line (column) index. In this example, system 20 uses the following logic to select the subset of programming levels for the cell (i,j):

-   -   The full set of programming levels PV0 . . . PV3 is used if         interference is low.     -   Programming levels PV0, PV2 and PV3 are used if the memory cell         is subject to strong interference from cells (i−1,j) and/or         (i,j−1).     -   Programming levels PV0, PV1 and PV2 are used if the memory cell         is expected to cause strong interference to cells (i−1,j) and/or         (i,j−1) (for example because at least one of these neighbor         cells is programmed to PV1, and memory cell (i,j) is to be         programmed to PV3, which would cause level PV0 to overlap PV1 in         the neighbor cells).

The programming level constellations of FIGS. 5A-5C and 6 are example constellations that are chosen purely for the sake of conceptual clarity. In alternative embodiments, system 20 may use any other suitable constellations of programming levels and any other suitable method of selecting the programming levels for a given memory cell based on interference.

In alternative embodiments, system 20 may select a respective subset of programming levels for programming each memory cell by encoding the data in a way that causes the data to be mapped only to the programming levels in the subset. Codes of this sort are addressed, for example, in U.S. Provisional Patent Application 61/372,921, cited above; and by Kuznetsov and Kasami, in “An Error Correcting Scheme for Defective Memory,” IEEE Transactions on Information Theory, volume IT-24, no. 6, November, 1978, pages 712-718, which is incorporated herein by reference. See also an article by Armknecht et al., entitled “Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks,” Eurocrypt 2006, Springer-Verlag, which is incorporated herein by reference.

For example, consider a baseline constellation of four programming levels {L0,L1,L2,L3}, and assume that memory cells suffering from strong interference to the erased level are to be programmed using only the subset {L0,L2,L3} (i.e., omit level L1). The data for storage can be encoded with a suitable code, so as to produce a modified bit sequence that will never be mapped to L1 but only to the desired subset {L0,L2,L3}.

In an example embodiment, data is mapped to levels {L0,L1,L2,L3} using conventional 4-level MLC programming, i.e., Least Significant Bit (LSB) page programming followed by Most Significant Bit (MSB) page programming. In this example, the system may modify the data of the MSB page such that, for each cell that would conventionally be programmed to L1, the MSB data for that cell is inverted if the cell suffers strong interference from one or more neighbor cells.

This condition can be verified, for example, by examining the memory cells immediately before programming the MSB page, since at that time a considerable part of the interference is already present (the relevant interference in this case comprises mainly the interference to the erased level, which may also originate from previous word-lines). Erased cells with relatively high threshold voltages at this time should be marked as cells that should avoid using the L1 level.

Conditional data inversion of this sort may be implemented, for example, by performing bit-wise Exclusive-OR (XOR) between the data and a sequence that has “1” for every bit that should be inverted, “0” for every bit that must not be inverted (otherwise other cells will reach L1), and “do not care” elsewhere.

Such a sequence can be generated, for example, using a Linear Feedback Shift Register (LFSR). The seed of the LFSR is typically stored with the data such that data can be reconstructed during readout. The length of the LFSR seed typically corresponds to the number of cells for which the L1 level is to be avoided. The seed can be extracted, for example, by solving a set of linear equations over the finite binary Galois field GF(2), where each equation sets a specific output bit of the LFSR to its desired bit value (“0” or “1”). Using a longer seed will enable avoiding L1 for a larger portion of the desired cells with higher probability.

Alternatively to using an LFSR, the memory cells can be divided into groups of N cells. Within each group, the MSB data of all the cells is inverted if at least one cell meets the condition that requires inversion. A single bit is stored for each group so as to indicate whether the MSB data of this group is inverted or not. This technique assumes that the number of cells whose MSB data needs to be inverted is small. When using this technique, some cells that suffer from high interference may eventually reach L1, but their number will be small.

Further alternatively, system 20 may select a respective subset of programming levels for programming each memory cell using Trellis shaping. In these embodiments, the system adds parity bits to the data (e.g., p parity bits for every k data bits). The parity bits are chosen such that there will be a numerically-efficient way to enumerate all legal 2^(k) words. For example, the parity bits can be chosen as the parity of a convolutional code, and the code-words can be enumerated using the Viterbi algorithm. Then, the code-words are enumerated, and the code-word that optimizes a predefined criterion is chosen.

A similar approach used in communication systems is described in the article by Formey, cited above. In the disclosed technique, the predefined criterion may comprise, for example, minimization of interference to the previous word-line, or only to erased cells of the previous word-line. The Viterbi algorithm will automatically avoid using high programming levels in cases where the neighbor cell interference should be minimized. Interference reduction improves as the number of parity bits increases.

Storing Information Regarding Selected Programming Levels

In the embodiments described above, system 20 assigns a respective set of programming levels for each memory cell, and then stores data in that memory cell using the assigned set of programming levels. Thus, different memory cells may hold data that is stored using different sets of programming levels. When preparing to read data from a given memory cell, the system should be aware of the set of programming levels that was assigned to that cell, otherwise the data may not be read correctly.

For example, different sets of programming levels may have different mapping of data, or they may be read using different read thresholds. In particular, different memory cells may hold different numbers of bits. In such a case, reading a given memory cell using the wrong set of programming levels may cause a propagating error that affects readout from subsequent memory cells. For example, using the wrong set of programming levels may cause “insertion errors” or “deletion errors” in which spurious data bits are mistakenly inserted or removed from the sequence of detected data bits, which shifts the position of subsequent bits in the sequence.

In some embodiments, system 20 (typically MSP 40) stores information that is indicative of the sets of programming levels assigned to the various memory cells. The information may be stored in memory array 28 or in any other suitable location. When preparing to read data from a group of memory cells 32 (e.g., a word line), system 20 queries the stored information, and then reads the memory cells in accordance with the sets of programming levels indicated by this information.

In some embodiments, system 20 compresses the information regarding the sets of programming levels, in order to reduce the memory space needed to store it. In one example embodiment, system 20 represents each possible set of programming levels by a respective unique binary string. Typically, the different binary strings are of the same length. The system concatenates the binary strings for the memory cells of a given cell group (a word line in the present example), to form a binary word. The binary word of a given word line indicates the sets of programming levels that were used for storing data in the various memory cells of that word line. The system encodes the binary word with a certain systematic Error Correction Code (ECC) so as to produce redundancy bits, and stores only the redundancy bits of the ECC.

When reading the given word line, the system reads the previous word line as well, or all the cells that interfere with the page of cells whose data is requested, and attempts to recreate the process of selecting programming levels for the given word line, based on the read previous word line. In other words, the system generates an estimate of the binary word of the given word line based on the read results of the previous word line. Then, the system corrects any errors in the estimated binary word using the stored redundancy information that was originally computed for the true binary word. Using this technique, the system is able to reconstruct the programming levels assigned to the different memory cells in the given word line while storing only a relatively small number of redundancy bits.

Once the binary word is reconstructed, the system is able to determine the set of programming levels used for each memory cell, and therefore read the data correctly. In some embodiments, the system stores the redundancy information using a high-reliability storage configuration, e.g., using only a single bit per cell (two programming levels per memory cell).

In alternative embodiments, system 20 may use any other suitable compression mechanism to reduce the memory space needed for storing the information that indicates the assigned sets of programming levels. Note that the ECC redundancy bits that are stored in this scheme convey information on the data of the interfering cells, and can therefore be used to aid in detecting this data.

Data Storage Method Description

FIG. 7 is a flow chart that schematically illustrates a method for data storage, in accordance with an embodiment of the present invention. The method begins with system 20 accepting data for storage in a given word line, at an input step 80. For each memory cell in the word line, the system selects a respective set of programming levels that are to be used in storing data in that memory cell, at a level selection step 84. As explained above, the selection of programming levels for a particular memory cell depends on the level of interference between that memory cell and at least one other memory cell in array 28.

System 20 then stores the data in the memory cells of the word line in accordance with the respective selected sets of programming levels, at a data storage step 88. The system stores information that is indicative of the selected sets of programming levels, at an indication storage step 92. The method then loops back to step 80 above, in order to store the data of the next word line.

In the embodiments described herein, the assignment of programming levels (selection of nominal analog values) for each memory cell is carried out by R/W circuitry 38 in memory device 24. In alternative embodiments, however, this task or parts thereof can be carried out by MSP 40 or other memory controller. Generally, assignment of programming levels (selection of nominal analog values) for the memory cells can be carried out by any suitable programming circuitry, which may comprise R/W circuitry 38, MSP 40, and/or any other suitable system element.

Additional Embodiments

FIGS. 8A-8C are graphs showing programming level constellations, in accordance with embodiments of the present invention. In these embodiments, a joint constellation of programming levels is used for programming a target memory cell and an interfering memory cell that causes interference to the target cell. In the embodiments of FIGS. 8A-8C the target and interfering cells are vertical neighbors, i.e., belong to the same bit line and to adjacent word lines. In alternative embodiments, however, this technique can be used with any other pair of target and interfering memory cells. For example, when each word line is divided into odd- and even-order cells that are programmed separately, the target and interfering memory cells may be horizontal neighbors, i.e., neighboring cells belonging to the same word line.

FIG. 8A shows a constellation of programming levels that does not use the disclosed technique, as a reference. In this example, the target memory cell belongs to a word line denoted WL_(n), and the interfering memory cell is the vertical neighbor of the target memory cell in the next word line, denoted WL_(n+1). Since WL_(n+1) is programmed after WL_(n), the P&V process does not cancel this interference.

The programming levels of the two memory cells are shown as two-dimensional coordinates, wherein the horizontal axis corresponds to the threshold voltage of the target cell (in WL_(n)), and the vertical axis corresponds to the threshold voltage of the interfering cell (in WL_(n+1)). In the present example, each memory cell holds two bits in four programming levels. Thus, the programming levels of the two memory cells correspond to sixteen nominal analog values 100, marked as “X” in the figure. Without interference or other impairments (e.g., aging-related drift), the threshold voltage distributions of the memory cells are typically centered at these analog values.

When the interfering memory cell causes cross-coupling interference to the target memory cell, the programming levels are typically distorted. In an example interference scenario, the programming levels correspond to distorted analog values 104, marked as “{circle around (×)}” in the figure. This distortion typically degrades the storage reliability of the memory cells. In FIG. 8A, for example, the read thresholds used for reading the target memory cell are marked by vertical dashed lines in the figure. The read thresholds are typically positioned mid-way between adjacent nominal analog values 100. When interference is present, however, some of distorted analog values 104 become closer to the read thresholds, and this effect increases the probability of read errors.

FIG. 8B shows an alternative constellation of programming levels, in accordance with an embodiment of the present invention. The constellation of FIG. 8B uses only a subset of the programming levels of FIG. 8A, in order to reduce the probability of read errors caused by the interference. The constellation of FIG. 8B includes the programming levels whose distorted analog values 104 are sufficiently distant from the read thresholds. Programming levels whose distorted analog values 104 are close to the read thresholds have been removed from the constellation.

Thus, the constellation of FIG. 8B has a considerably lower error probability than the constellation of FIG. 8A in the presence of interference. On the other hand, the constellation of FIG. 8B has a lower storage capacity, because it has a smaller number of programming levels. In the present example, the constellation of FIG. 8A has a capacity of 2 bits/cell, whereas the constellation of FIG. 8B has a capacity of 1.5 bits/cell.

FIG. 8C shows another example constellation of programming levels, in accordance with an alternative embodiment of the present invention. This constellation includes two additional programming levels that are not included in the constellation of FIG. 8B. As a result, the storage capacity of this constellation is slightly higher (˜1.66 bits/cell on average) at the expense of slightly degraded error probability.

The programming level constellations of FIGS. 8A-8C are example constellations, which were chosen purely for the sake of conceptual clarity. In alternative embodiments, any other suitable constellations can also be used. For example, the disclosed technique can be used with memory cells that hold any suitable number of bits per cell, e.g., eight-level or sixteen-level memory cells. Any suitable mapping of programming levels to bits can be used.

Although the embodiments described herein mainly address floating-gate interference between memory cells, the methods and systems described herein can also be used to combat other impairments, such as program disturbs and other types of cross-cell interference. In the present context, any such impairment or distortion is regarded as a kind of interference.

The description above refers mainly to a linear model for inter-cell interference, in which the voltage shift in the interfered cell is proportional to the read voltage X of the interfering cell. The proposed methods are similarly applicable to any other suitable non-linear or linear interference models. For example, in some cases it may be more accurate to model the voltage shift in the interfered cell as linearly proportional to the amount of charge in the interfering cell, which is proportional to the readout value of the interfering cell in the absence of interference to the interfering cell.

It will thus be appreciated that the embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and sub-combinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art. 

The invention claimed is:
 1. A method for data storage, comprising: accepting data for storage in a memory comprising multiple memory cells; assigning, for each memory cell, a respective set of nominal analog values for representing data values to be stored in the memory cell, by choosing the nominal analog values for a given memory cell in a respective range that depends on interference between the given memory cell and at least one other memory cell in the memory; encoding the data with a shaping code that causes the encoded data to be mapped to the nominal analog values chosen within the respective range in each memory cell; and storing the encoded data in each memory cell using the respective selected set of the nominal analog values; dividing, for a group of N memory cells, an N-dimensional space that includes a number of combinations of respective analog values of the N memory cells into a first region that includes combinations of nominal analog values that are unavailable for assignment due to the interference, and a second region includes combinations of nominal analog values that are available for assignment; and assigning the sets of the nominal analog values to the N memory cells only within the second region.
 2. The method according to claim 1, wherein assigning the nominal analog values comprises choosing the nominal analog values for the given memory cell in a first range when the given memory cell is subjected to the interference from the at least one other memory cell, and choosing the nominal analog values for the given memory cell in a second range, lower than the first range, when the given memory cell is not subjected to the interference from the at least one other memory cell.
 3. The method according to claim 1, wherein assigning the nominal analog values comprises choosing the nominal analog values for the given memory cell in a first range when the given memory cell is expected to cause the interference to the at least one other memory cell, and choosing the nominal analog values for the given memory cell in a second range, higher than the first range, when the given memory cell is not expected to cause the interference to the at least one other memory cell.
 4. The method according to claim 1, wherein assigning the nominal analog values comprises selecting, for each memory cell, at least one parameter selected from a group of parameters consisting of a minimum programming voltage, a maximum programming voltage, and a size of the set of the nominal analog values.
 5. The method according to claim 1, wherein assigning the nominal analog values comprises choosing the nominal analog values in the range in which a maximum difference between the nominal analog values assigned to the given memory cell and the nominal analog values assigned to the at least one other memory cell does not exceed a predefined threshold.
 6. The method according to claim 1, wherein assigning the nominal analog values comprises assigning to the given memory cell a first number of the analog values when the interference is low, and a second number of the analog values, lower than the first number, when the interference is high.
 7. The method according to claim 1, wherein assigning the nominal analog values comprises providing a baseline set of the analog values, and assigning to each memory cell a respective subset of the baseline set, which lies in the respective range, depending on the interference.
 8. The method according to claim 1, wherein the shaping code comprises a Trellis Shaping code.
 9. The method according to claim 1, wherein assigning the nominal analog values for a group of the memory cells comprises initially choosing the nominal analog values for all the memory cells in the group, and subsequently mapping a respective data value to one of the chosen nominal analog values in each of the memory cells.
 10. The method according to claim 1, wherein assigning the nominal analog values for a group of the memory cells comprises choosing the nominal analog values for a first memory cell in the group and mapping a respective data value to one of the nominal analog values chosen for the first memory cell, and choosing the nominal analog values for a second memory cell in the group based on the data value mapped to the first memory cell.
 11. The method according to claim 1, wherein two or more memory cells are assigned respective sets of the nominal analog values that are drawn from a superset of K possible nominal analog values, and wherein storing the data comprises shaping a sequence of data bits into respective shaped bits by mapping the sequence of data bits to a subset of the K possible nominal analog values, and storing the shaped bits in the respective memory cells using the assigned respective sets.
 12. A data storage apparatus, comprising: an interface for communicating with a memory comprising multiple memory cells; and programming circuitry, which is configured to: accept data for storage in the memory; assign, for each memory cell, a respective set of nominal analog values for representing data values to be stored in the memory cell, by choosing the nominal analog values for a given memory cell in a respective range that depends on interference between the given memory cell and at least one other memory cell in the memory; encode the data with a shaping code that causes the encoded data to be mapped to the nominal analog values chosen within the respective range in each memory cell; and store the encoded data in each memory cell using the respective selected set of the nominal analog values; divide, for a group of N memory cells, an N-dimensional space that includes a number of combinations of respective analog values of the N memory cells into a first region that includes combinations of nominal analog values that are unavailable for assignment due to the interference, and a second region includes combinations of nominal analog values that are available for assignment; and assign the sets of the nominal analog values to the N memory cells only within the second region.
 13. The apparatus according to claim 12, wherein the programming circuitry is configured to choose the nominal analog values for the given memory cell in a first range when the given memory cell is subjected to the interference from the at least one other memory cell, and to choose the nominal analog values for the given memory cell in a second range, lower than the first range, when the given memory cell is not subjected to the interference from the at least one other memory cell.
 14. The apparatus according to claim 13, wherein the programming circuitry is configured to store information indicative of the assigned sets of the nominal analog values.
 15. The apparatus according to claim 14, wherein the programming circuitry is configured to retrieve the data from the memory cells by retrieving the stored information, recreating the assigned sets from the retrieved information, and reading the data from the memory cells in accordance with the recreated sets of the nominal analog values.
 16. The apparatus according to claim 15, wherein the programming circuitry is configured to store the information by encoding the information with an Error Correction Code (ECC) so as to produce data bits and redundancy bits and storing only the redundancy bits, and to recreate the assigned sets by reading some of the memory cells so as to estimate assignment of the sets, applying error correction to the estimated assignment using the stored redundancy bits, and recreating the sets from the estimated assignment after the error correction.
 17. The apparatus according to claim 12, wherein the programming circuitry is configured to assign to first and second memory cells respective first and second sets of the nominal analog values having at least one nominal analog value in common.
 18. The apparatus according to claim 12, wherein the programming circuitry is configured to assign to first and second memory cells respective first and second sets of the nominal analog values, such that the first set is a subset of the second set.
 19. A data storage apparatus, comprising: a memory comprising multiple memory cells; and programming circuitry, which is configured to: accept data for storage in the memory; assign, for each memory cell, a respective set of nominal analog values for representing data values to be stored in the memory cell, by choosing the nominal analog values for a given memory cell in a respective range that depends on interference between the given memory cell and at least one other memory cell in the memory; encode the data with a shaping code that causes the encoded data to be mapped to the nominal analog values chosen within the respective range in each memory cell; and store the encoded data in each memory cell using the respective selected set of the nominal analog values; divide, for a group of N memory cells, an N-dimensional space that includes a number of combinations of respective analog values of the N memory cells into a first region that includes combinations of nominal analog values that are unavailable for assignment due to the interference, and a second region includes combinations of nominal analog values that are available for assignment; and assign the sets of the nominal analog values to the N memory cells only within the second region. 